Some Convergence Results for Probabilistic Tabu Search
نویسندگان
چکیده
منابع مشابه
Tabu search and finite convergence
We establish finite convergence for some tabu search algorithms based on recency memory or frequency memory, distinguishing between symmetric and asymmetric neighborhood structures. These are the first demonstrations of explicit bounds provided by such forms of memory, and their finiteness suggests an important distinction between these ideas and those underlying certain "probabilistic" procedu...
متن کاملProbabilistic Tabu Search for Telecommunications Network Design
This paper presents a computational study of a network design problem arising in the telecommunication industry. The objective can be formulated as that of nding an optimal degree constrained Steiner tree in a graph whose nodes and edges are weighted by costs. We develop a probabilistic Tabu Search heuristic for this problem, addressing issues of move evaluations, error correction, tabu memorie...
متن کاملConvergence Analysis of Adaptive Tabu Search
This paper presents a convergence proof of the adaptive tabu search (ATS) algorithms. The proof consists of two parts, i.e. convergence proof of all interested solutions in a finite search space, and that of searching processes of the ATS algorithms to the global minimum. With the proposed definitions and theorems, the proofs show that the ATS algorithms based on a random process have finite co...
متن کاملHybrid Probabilistic Search Methods for Simulation Optimization
Discrete-event simulation based optimization is the process of finding the optimum design of a stochastic system when the performance measure(s) could only be estimated via simulation. Randomness in simulation outputs often challenges the correct selection of the optimum. We propose an algorithm that merges Ranking and Selection procedures with a large class of random search methods for continu...
متن کاملProbabilistic GRASP-Tabu Search algorithms for the UBQP problem
This paper presents two algorithms combining GRASP and Tabu Search for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. We first propose a simple GRASP-Tabu Search algorithm working with a single solution and then reinforce it by introducing a population management strategy. Both algorithms are based on a dedicated randomized greedy construction heuristic and a tabu search...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ORSA Journal on Computing
سال: 1992
ISSN: 0899-1499,2326-3245
DOI: 10.1287/ijoc.4.1.32